Click any tag below to further narrow down your results
Links
Faiss is an open-source C++ library with Python bindings for searching and clustering large sets of dense vectors, including sets too big to fit in RAM. Its GPU implementations are built for speed, and it's developed mainly by Meta's Fundamental AI Research group.
- Compressed-representation indexes can scale to billions of vectors in main memory on a single server, at some cost to search precision.
- HNSW and NSG add graph-based indexing structures on top of raw vectors to make search faster.
- GPU indexes can be swapped in as drop-in replacements for CPU ones (e.g., IndexFlatL2 to GpuIndexFlatL2), with single and multi-GPU support.
- The library is MIT-licensed and only requires a BLAS implementation as a core dependency.
pg_vectorsearch is an alpha PostgreSQL extension that indexes vectors using PRISM, a hierarchical partitioning method with quantization. It outperforms pgvector's IVFFlat and HNSW indexes on speed and recall, even while using a quarter of the memory on 100-million-vector datasets.
- PRISM uses a hierarchical centroid tree, RaBitQ quantization with error bounds, and SIMD-optimized distance computation to achieve faster queries and index builds than existing PostgreSQL vector indexes.
- Works with both native vec32/vec16 column types and existing pgvector vector/halfvec columns without requiring table rewrites or query changes.
- Supports dynamic updates (inserts, updates, deletes) with a prism_rebalance procedure to split oversized posting lists, and requires PostgreSQL 18+ with a C11 compiler.
Pinterest engineered Manas, an embedding retrieval system handling billions of vectors with approximate nearest neighbor search, hybrid queries, and real-time updates. They optimized it through quantization techniques that cut computing resources by 10-15% while maintaining search accuracy.
- SIMD intrinsics on 8-bit integers reduced per-query compute by 10-15% without sacrificing performance
- Product quantization on disk storage paired with full-precision centroids improved both accuracy and throughput, diverging from the original SPANN approach
- The system supports hybrid queries combining token and embedding search with sub-second indexing of new content
This article discusses the integration of Engram, a memory product built on Weaviate's vector search technology, into Claude Code. It explores the challenges and improvements in memory recall, particularly how Engram captures contextual details that MEMORY.md cannot, ultimately enhancing workflow efficiency.
- Engram is largely ignored by Claude unless given explicit triggers for when to save and recall memory, requiring deliberate workflow restructuring rather than passive integration
- Shorter, more focused memory saves improved retrieval speed and efficiency compared to longer entries
- Over two weeks of testing, Engram noticeably improved "decision archaeology" (recalling reasoning behind past choices) but failed to help during planning sessions
- The integration added roughly 10% overhead/slowdown to sessions despite its benefits